منابع مشابه
Routing on trees
We consider three different schemes for signal routing on a tree. The vertices of the tree represent transceivers that can transmit and receive signals, and are equipped with i.i.d. weights representing the strength of the transceivers. The edges of the tree are also equipped with i.i.d. weights, representing the costs for passing the edges. For each one of our schemes, we derive sharp conditio...
متن کاملRouting on Trees
In this paper, we study the permutation packet routing problem on trees. We show that every permutation can be routed on a tree of n vertices in n ? 1 routing steps. We provide two algorithms that produce such routing schedules. The rst algorithm builds in O(n 2) time a schedule that needs O(n 2) bits for its description while the second one produces in O(n 3) time a schedule that can be descri...
متن کاملPeriodic Packet Routing on Trees
In the periodic packet routing problem each of a set of tasks repeatedly emits packets over an infinite time horizon. These have to be routed along their fixed path through a common network. A schedule must resolve the resource conflicts on the arcs, such that the maximal delay any packet experiences can be bounded. We prove that such a schedule exists if and only if a simple to check criterion...
متن کاملLocation Routing Problems on Trees
This paper addresses combined location/routing problems defined on trees, where not all vertices have to be necessarily visited. A mathematical programming formulation is presented, which has the integrality property. The formulation models a directed forest where each connected component hosts at least one open facility, which becomes the root of the component. The problems considered can also...
متن کاملRandomized Routing on Fat-Trees
Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor λ on a f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.05.016